RattleSnake: Stochastic Folding for Chain Programmable Matter
نویسندگان
چکیده
The vision of programmable matter is to create a blob of material that can transform itself into an arbitrary form. One promising approach for achieving programmable matter is to construct a chain of identical nodes that can fold into arbitrary threedimensional shapes. Previous active electromechanical systems have demonstrated this concept but are currently costly, complex, and not robust enough to scale to smaller sizes or larger numbers of nodes. The goal of this thesis is to explore methods of simplifying chain programmable matter by removing the actuator from each node and, instead, putting energy into the system externally through stochastic vibrations. Each node takes this random energy input and rectifies it to produce motion towards the target position. We propose two variants of this system: 1) smart clutches that can be reprogrammed in situ and fold through arbitrary paths in configuration space and 2) ratchets that are programmed ahead of time and are entirely passive. We developed a chain using the ratchet concept and also constructed a new active, electromechanical chain with reduced cost and improved speed and torque compared to previous electromechanical systems. Through experimental and computer simulated studies, we determined that stochastic actuation can simplify and reduce the cost of these systems. We have also identified how the size of the increments of the ratchet, length of the chain, and the amplitude and frequency of agitation affect the folding time and success rate. In addition, we show that passive folding systems should improve in performance as the hardware scales down. Thesis Supervisor: Neil Gershenfeld Professor of Media Arts and Sciences The material in this thesis was also based upon work supported by, or in part by, the U. S. Army Research Laboratory and the U. S. Army Research Office under contract/grant number W911NF-08-1-0254. RattleSnake: Stochastic Folding for Chain Programmable Matter by Maxim B. Lobovsky The following person served as a reader for this thesis:
منابع مشابه
A Stochastic Approach to Shortcut Bridging in Programmable Matter
In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and configuration. In this paper, we consider stochastic, distributed, local, asynchronous algorithms for “shortcut bridging,” in which particles self-assemble brid...
متن کاملElectropermanent magnetic connectors and actuators: devices and their application in programmable matter
Programmable matter is a digital material having computation, sensing, and actuation capabilities as continuous properties active over its whole extent. To make programmable matter economical to fabricate, we want to use electromagnetic direct drive, rather than clockwork, to actuate the particles. Previous attempts to fabricate small scale (below one centimeter) robotic systems with electromag...
متن کاملProgrammable matter by folding.
Programmable matter is a material whose properties can be programmed to achieve specific shapes or stiffnesses upon command. This concept requires constituent elements to interact and rearrange intelligently in order to meet the goal. This paper considers achieving programmable sheets that can form themselves in different shapes autonomously by folding. Past approaches to creating transforming ...
متن کاملUniversal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid—for example, the surface of any polycube. The folding is efficient: for target surfaces topologically equivalent to a sphere, the strip needs to have only twice the target surface area, and the folding stacks at most two layers of material anywhe...
متن کاملOptimizing Programmable Logic Arrays Using the Simulated Annealing Algorithm
In the paper the programmable logic array (PLA) topological optimization problem is dealt with using folding techniques. A PLA folding algorithm based on the method of simulated annealing is presented. A simulated-annealing PLA folding algorithm is presented for multiple unconstrained folding. Then, the algorithm is extended to handle constrained folding. In this way, simple folding is consider...
متن کامل